Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models
نویسندگان
چکیده
منابع مشابه
Bicriteria Resource Allocation Problem in Pert Networks
We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...
متن کاملExpected Duration of Dynamic Markov PERT Networks
Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...
متن کاملA heuristic method for consumable resource allocation in multi-class dynamic PERT networks
This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...
متن کاملA Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملA Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks
This paper presents a hybrid heuristic for constrained resource allocation in PERT type networks. Here, the assumption is made that the constrained resource is renewable for allocation to the activities of project. In addition, we consider finish-start precedence constraints with zero time lag. The activities durations are independent continuous random variables, preemption is not allowed and r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 7 شماره
صفحات -
تاریخ انتشار 2003